Post correspondence problem

Post correspondence problem

English-Russian electronics dictionary .

Игры ⚽ Нужно сделать НИР?

Смотреть что такое "Post correspondence problem" в других словарях:

  • Post correspondence problem — The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946.[1] Because it is simpler than the halting problem and the Entscheidungsproblem it is often used in proofs of undecidability. Contents 1… …   Wikipedia

  • Post correspondence problem — Das Postsche Korrespondenzproblem (nach Emil Leon Post, abgekürzt auch PKP oder englisch PCP) ist ein Beispiel für ein unentscheidbares Problem in der Theoretischen Informatik. Es wird häufig verwendet, um mittels Reduktion die Unentscheidbarkeit …   Deutsch Wikipedia

  • Correspondence problem — For the problem in theory of computation, see Post correspondence problem. The correspondence problem tries to figure out which parts of an image correspond to which parts of another image, after the camera has moved, time has elapsed, and/or the …   Wikipedia

  • Post'sches Korrespondenzproblem — Das Postsche Korrespondenzproblem (nach Emil Leon Post, abgekürzt auch PKP oder englisch PCP) ist ein Beispiel für ein unentscheidbares Problem in der Theoretischen Informatik. Es wird häufig verwendet, um mittels Reduktion die Unentscheidbarkeit …   Deutsch Wikipedia

  • Emil Leon Post — Infobox Scientist name = Emil Leon Post image width = birth date = February 11, 1897 birth place = Augustów, then Russian Empire death date = April 21 1954, death place = New York City, flagicon|USA U.S. residence = nationality = field =… …   Wikipedia

  • Emil Post — Pour les articles homonymes, voir Post. Emil Leon Post Emil Leon Post (né le 11 février 1897 à Augustów et mort le 21 avril 1954 à New York) est un mathématicien …   Wikipédia en Français

  • Undecidable problem — In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct an algorithm that leads to a yes or no answer the problem is not decidable.A decision problem is any …   Wikipedia

  • Chess problem — Part of a series on Puzzles …   Wikipedia

  • Demarcation problem — The demarcation problem (or boundary problem[1]) in the philosophy of science is about how and where to draw the lines around science. The boundaries are commonly drawn between science and non science, between science and pseudoscience, between… …   Wikipedia

  • Co-operative Correspondence Club — The Cooperative Correspondence Club (CCC) was a group of approximately twenty four women, living all over the United Kingdom, who wrote to each other in the form of a private correspondence magazine from 1936 1990. Contents 1 Origin 2 Background… …   Wikipedia

  • Proof of impossibility — A proof of impossibility, sometimes called a negative proof or negative result , is a proof demonstrating that a particular problem cannot be solved, or cannot be solved in general. Often proofs of impossibility have put to rest decades or… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»